منابع مشابه
Linear Bounds for Stochastic Dispersion
It has been suggested that stochastic flows might be used to model the spread of passive tracers in a turbulent fluid. We define a stochastic flow by the equations φ0 x = x dφt x = F dt φt x where F t x is a field of semimartingales on x ∈ d for d ≥ 2 whose local characteristics are bounded and Lipschitz. The particles are points in a bounded set , and we ask how far the substance has spread in...
متن کاملPerformance bounds for linear stochastic control
Wedevelop computational bounds onperformance for causal state feedback stochastic controlwith linear dynamics, arbitrary noise distribution, and arbitrary input constraint set. This can be very useful as a comparison with the performance of suboptimal control policies, which we can evaluate using Monte Carlo simulation. Our method involves solving a semidefinite program (a linear optimization p...
متن کاملRestricted-Recourse Bounds for Stochastic Linear Programming
We consider the problem of bounding the expected value of a linear program (LP) containing random coe&cients, with applications to solving two-stage stochastic programs. An upper bound for minimizations is derived from a restriction of an equivalent, penalty-based formulation of the primal stochastic LP, and a lower bound is obtained from a restriction of a reformulation of the dual. Our “restr...
متن کاملOn the role of bounds in stochastic linear programming
Stochastic linear programming (SLP) models involve multivariate integrals. Although in the discretely distributed case these integrals become sums they typically contain a large amount of terms. The purpose of this paper is twofold: On the one hand we discuss the usage of bounds concerning integrals for constructing SLP algorithms and secondly we point out the role of bounds–based algorithms fo...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Annals of Probability
سال: 2000
ISSN: 0091-1798
DOI: 10.1214/aop/1019160510